منابع مشابه
An Integration of Mechanised Reasoning
Mechanised reasoning systems and computer algebra systems have apparently di erent objectives. Their integration is, however, highly desirable, since in many formal proofs both of the two di erent tasks, proving and calculating, have to be performed. Even more importantly, proof and computation are often interwoven and not easily separable. In the context of producing reliable proofs, the quest...
متن کاملMechanised Separation Algebra
We present an Isabelle/HOL library with a generic type class implementation of separation algebra, develop basic separation logic concepts on top of it, and implement generic automated tactic support that can be used directly for any instantiation of the library. We show that the library is usable by multiple example instantiations that include common as well as more exotic base structures such...
متن کاملMechanised Refinement of Procedures
Refine is a tool that supports the application of Morgan’s refinement calculus. It was designed to support teaching and use by beginners; it is already in use. We describe here the extension of Refine to support the development of (possibly recursive) procedures in the algebraic style of the refinement calculus already adopted by Refine. Resumo. Refine é uma ferramenta que suporta a aplicação d...
متن کاملMechanised Computability Theory
This paper presents a mechanisation of some basic computability theory. The mechanisation uses two models: the recursive functions and the λcalculus, and shows that they have equivalent computational power. Results proved include the Recursion Theorem, an instance of the s-m-n theorem, the existence of a universal machine, Rice’s Theorem, and closure facts about the recursive and recursively en...
متن کاملMechanised Theory Engineering in Isabelle
This is an introduction to mechanised theory engineering in Isabelle, an LCF-style interactive theorem prover. We introduce an embedding of Hoare & He’s Unifying Theories of Programming (UTP) in Isabelle (named Isabelle/UTP) and show how to mechanise two key theories: relations and designs. These theories are su cient to give an account of the partial and total correctness of nondeterministic s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Res Medica
سال: 2014
ISSN: 2051-7580,0482-3206
DOI: 10.2218/resmedica.v6i5.879